Equivalence of Well-Founded and Stable Semantics
نویسنده
چکیده
We show that the well-founded semantics and the stable semantics are equivalent on the class of the order-consistent programs which is a strict super-class of the locally-stratified programs class and of the call-consistent programs class. (1) Université de Paris 1 90 rue de Tolbiac 75634 Paris cedex 13 FRANCE email: [email protected]
منابع مشابه
Well Founded Semantics and Stable Semantics of Semi-Strict Programs
In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.
متن کاملPredicate Introduction Under Stable and Well-Founded Semantics
This paper studies the tranformation of “predicate introduction”: replacing a complex formula in an existing logic program by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certai...
متن کاملLogical Foundations of Well-Founded Semantics
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The problem addressed is this: which (non-modal) logic can be considered adequate for well-founded semantics in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? We approach this problem by identifying the HT ...
متن کاملA Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics
We consider the problem of strong equivalence [1] under the infinite-valued semantics [2] (which is a purely model-theoretic version of the well-founded semantics). We demonstrate that two programs are now strongly equivalent if and only if they are logically equivalent under the infinite-valued logic of [2]. In particular, we show that for propositional programs, strong equivalence is decidabl...
متن کاملAnalysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
In [4] a nonmonotonic formalism called partial equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in de ning a class of minimal models, called partial equilibrium (p-equilibrium), inside a non-classical logic called HT 2. In [4] it was shown that, on normal logic programs, p-equilibrium models coincide with Przymusin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 21 شماره
صفحات -
تاریخ انتشار 1994